A Polynomial Algorithm of Optimum Cutting a Rectangle into Rectangles with Two Heights
نویسندگان
چکیده
منابع مشابه
A Polynomial Algorithm of Optimum Cutting a Rectangle into Rectangles with Two Heights
We consider the problem of guillotine cutting a rectangular sheet into rectangular pieces with two heights. A polynomial time algorithm for this problem is constructed.
متن کاملPartitioning a rectangle into small perimeter rectangles
Alon, N. and D.J. Kleitman, Partitioning a rectangle into small perimeter rectangles, Discrete Mathematics 103 (1992) 111-119. We show that the way to partition a unit square into kZ + s rectangles, for s = 1 or s = -1, so as to minimize the largest perimeter of the rectangles, is to have k 1 rows of k identical rectangles and one row of k + s identical rectangles, with all rectangles having th...
متن کاملThe Decomposition of a Rectangle into Rectangles of Minimal Perimeter
We solve the problem of decomposing a rectangle R into p rectangles of equal area so that the maximum rectangle perimeter is as small as possible. This work has applications in areas such as flexible object packing and data allocation. Our solution requires only a constant number of arithmetic operations and integer square roots to characterize the decomposition, and linear time to print the de...
متن کاملa study of translation of english litrary terms into persian
چکیده هدف از پژوهش حاضر بررسی ترجمه ی واژه های تخصصی حوزه ی ادبیات به منظور کاوش در زمینه ی ترجمه پذیری آنها و نیز راهکار های به کار رفته توسط سه مترجم فارسی زبان :سیامک بابایی(1386)، سیما داد(1378)،و سعید سبزیان(1384) است. هدف دیگر این مطالعه تحقیق در مورد روش های واژه سازی به کار رفته در ارائه معادل های فارسی واژه های ادبی می باشد. در راستای این اهداف،چارچوب نظری این پژوهش راهکارهای ترجمه ار...
15 صفحه اولOn Partitions of a Rectangle into Rectangles with Restricted Number of Cross Sections
Consider partitions of a rectangle into rectangles with restricted number of cross sections. The problem has an information theoretic flavor (in the spirit of [3]): richness of two dimensional pictures under 1–dimensional restrictions of from local information to global information. We present two approaches to upper bound the cardinality of such partitions: a combinatorial recursion and harmon...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: American Journal of Operations Research
سال: 2014
ISSN: 2160-8830,2160-8849
DOI: 10.4236/ajor.2014.41003